翻訳と辞書 Words near each other ・ Combinatorial method (linguistics) ・ Combinatorial number system ・ Combinatorial optimization ・ Combinatorial principles ・ Combinatorial proof ・ Combinatorial search ・ Combinatorial species ・ Combinatorial topology ・ Combinatoriality ・ Combinatorica ・ Combinatorics ・ Combinatorics and dynamical systems ・ Combinatorics and physics ・ Combinatorics on words ・ Combinatorics, Probability and Computing ・ Combinatory categorial grammar ・ Combinatory logic ・ COMBINE ・ Combine ・ Combine (enterprise) ・ Combine (Half-Life) ・ Combine car ・ Combine demolition derby ・ Combine harvester ・ Combine painting ・ Combine, Texas ・ Combined ・ Combined Action Program ・ Combined Agents of America ・ Combined Air Operations Centre Finderup Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Combinatory categorial grammar ： ウィキペディア英語版 Combinatory categorial grammar Combinatory categorial grammar (CCG) is an efficiently parsable, yet linguistically expressive grammar formalism. It has a transparent interface between surface syntax and underlying semantic representation, including predicate-argument structure, quantification and information structure. The formalism generates constituency-based structures (as opposed to dependency-based ones) and is therefore a type of phrase structure grammar (as opposed to a dependency grammar). CCG relies on combinatory logic, which has the same expressive power as the lambda calculus, but builds its expressions differently. The first linguistic and psycholinguistic arguments for basing the grammar on combinators were put forth by Steedman and Szabolcsi. More recent prominent proponents of the approach are (Jacobson ) and (Baldridge ). For example, the combinator B (the compositor) is useful in creating long-distance dependencies, as in "Who do you think Mary is talking about?" and the combinator W (the duplicator) is useful as the lexical interpretation of reflexive pronouns, as in "Mary talks about herself". Together with I (the identity mapping) and C (the permutator) these form a set of primitive, non-interdefinable combinators. Jacobson interprets personal pronouns as the combinator I, and their binding is aided by a complex combinator Z, as in "Mary lost her way". Z is definable using W and B. ==Parts of the Formalism== The CCG formalism defines a number of combinators (application, composition, and type-raising being the most common). These operate on syntactically-typed lexical items, by means of Natural deduction style proofs. The goal of the proof is to find some way of applying the combinators to a sequence of lexical items until no lexical item is unused in the proof. The resulting type after the proof is complete is the type of the whole expression. Thus, proving that some sequence of words is a sentence of some language amounts to proving that the words reduce to the type ''S''. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Combinatory categorial grammar」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.